ITERATED DETERMINISTIC SUBSTITUTION.ASVELD PRJ; ENGELFRIET J.1977; ACTA INFORMAT.; ALLEM.; DA. 1977; VOL. 8; NO 3; PP. 285-302Article

ON THE COVERING OF PARSABLE GRAMMARS.NIJHOLT A.1977; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1977; VOL. 15; NO 1; PP. 99-110; BIBL. 12 REF.Article

A DIRECT BRANCHING ALGORITHM FOR CHECKING EQUIVALENCE OF STRICT DETERMINISTIC VS. LL(K) GRAMMARSTOMITA E.1983; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1983; VOL. 23; NO 2; PP. 129-154; BIBL. 23 REF.Article

STRICT DETERMINISTIC GRAMMARS AND GREIBACH NORMAL FORMNIJHOLT A.1979; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DDR; DA. 1979; VOL. 15; NO 8-9; PP. 395-401; ABS. GER/RUS; BIBL. 8 REF.Article

A REPRESENTATION OF TREES BY LANGUAGES IICOURCELLE B.1978; THEOR. COMPUTER SCI.; NLD; DA. 1978; VOL. 7; NO 1; PP. 25-55; BIBL. 33 REF.Article

Decidability of DPDA equivalenceSTIRLING, Colin.Theoretical computer science. 2001, Vol 255, Num 1-2, pp 1-31, issn 0304-3975Article